Online Task Assignment and Coordination in Multi-Robot Fleets

نویسندگان

چکیده

We propose a loosely-coupled framework for integrated task assignment, motion planning, coordination and control of heterogeneous fleets robots subject to non-cooperative tasks. The approach accounts the important real-world requirement that tasks can be posted asynchronously. exploit systematic search optimal where interference is considered as cost estimated with knowledge kinodynamic models current state robots. Safety guaranteed by an online algorithm, absence collisions treated hard constraint. relation between weight in assignment computational overhead analyzed empirically, compared against alternative realizations using local algorithms assignment.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nature-Inspired Multi-Agent Coordination in Task Assignment Problems

The main problem when using multi-agent systems (MAS) for task assignment problems in real-world environments is the limited scalability of traditional MAS approaches such as centralized planning. Therefore, we look at a scalable, generic methodology inspired by nature for multi-agent coordination in large, embodied MAS, operating in noisy, real-time environments. More specifically, we look at ...

متن کامل

Scalable Task Assignment for Heterogeneous Multi-Robot Teams

This work deals with the development of a dynamic task assignment strategy for heterogeneous multi‐robot teams in typical real world scenarios. The strategy must be efficiently scalable to support problems of increasing complexity with minimum designer intervention. To this end, we have selected a very simple auction‐based strategy, which has been implemented and analyse...

متن کامل

Distributed on-line dynamic task assignment for multi-robot patrolling

Abstract Multi-Robot Patrolling is a key feature for various applications related to surveillance and security, and it has been studied from several different perspectives, ranging from techniques that devise optimal off-line strategies to implemented systems. However, still few approaches consider on-line decision techniques that can cope with uncertainty and non-determinism in robot behaviors...

متن کامل

Distributed Algorithm Design for Multi-robot Generalized Task Assignment

We present a provably-good distributed algorithm for generalized task assignment problem in the context of multirobot system (MR-GAP), where a group of robots need to cooperate to complete a group of tasks. In MR-GAP, each robot has its own resource budget constraint, and needs to consume a certain amount of resource to obtain a payoff for each task. The overall objective is to find a maximum p...

متن کامل

Efficient Online Multi-robot Exploration via Distributed Sequential Greedy Assignment

This work addresses the problem of efficient online exploration and mapping using multi-robot teams via a distributed algorithm for planning for multi-robot exploration— distributed sequential greedy assignment (DSGA)—based on the sequential greedy assignment (SGA) algorithm. SGA permits bounds on suboptimality but requires all robots to plan in series. Rather than plan for robots sequentially ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics and automation letters

سال: 2021

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2021.3068918